Resolvability of Infinite Designs
نویسندگان
چکیده
In this paper we examine the resolvability of infinite designs. We show that in stark contrast to the finite case, resolvability for infinite designs is fairly commonplace. We prove that every t-(v, k,Λ) design with t finite, v infinite and k, λ < v is resolvable and, in fact, has α orthogonal resolutions for each α < v. We also show that, while a t-(v, k,Λ) design with t and λ finite, v infinite and k = v may or may not have a resolution, any resolution of such a design must have v parallel classes containing v blocks and at most λ − 1 parallel classes containing fewer than v blocks. Further, a resolution into parallel classes of any specified sizes obeying these conditions is realisable in some design. When k < v and λ = v and when k = v and λ is infinite, we give various examples of resolvable and non-resolvable t-(v, k,Λ) designs.
منابع مشابه
On an Algorithm for a Double-resolvability Test
To find all doubly resolvable designs with definite parameters, we construct the design resolutions in lexicographic order point by point. To partial solutions with more than 2/3 of the points we apply a double-resolvability test, namely we try to construct an orthogonal resolution. The test reduces significantly the number of partial solutions, and is very important for the efficiency of the w...
متن کاملUse of Resolvable Designs in Field and on Farm Experiments
1. Introduction Resolvable designs, though introduced in the combinatorial context, have found their utility in field experiments. The concept of resolvability is due to Bose (1942) who defined this for a balanced incomplete block (BIB) design. A BIB design is an arrangement of v treatments into b blocks such that each block contains k (< v) distinct treatments, each treatment appears in r bloc...
متن کاملNOTE Enumeration of All Simple t (t+7,t+1,2) Designs
We enumerate by computer algorithms all simple t (t +7, t +1, 2) designs for 1 t 5, i.e. for all possible t , and this enumeration is new for t 3. The number of nonisomorphic designs is equal to 3, 13, 27, 1 and 1 for t = 1, 2, 3, 4 and 5, respectively. We also present some properties of these designs including orders of their full automorphism groups and resolvability.
متن کاملDesigning Designs
Interesing groups often occur as automorphism groups of some combinatorial objects. One may use these objects to obtain a representation of the constructed designs. Our combinatorial objects are graphs. Representing a design graphically may make certain properties of a combinatorial design obvious that otherwise would require tedious reasoning. This holds for symmetries, resolvability, and sub-...
متن کاملRegular low-density parity-check codes from oval designs
This paper presents a construction of low-density parity-check (LDPC) codes based on the incidence matrices of oval designs. The new LDPC codes have regular parity-check matrices and Tanner graphs free of 4-cycles. Like the finite geometry codes, the codes from oval designs have parity-check matrices with a large proportion of linearly dependent rows and can achieve significantly better minimum...
متن کامل